Title of dissertation : EXPLOITING IDLE CYCLES IN NETWORS OF WORKSTATIONS
نویسندگان
چکیده
Title of dissertation: EXPLOITING IDLE CYCLES IN NETWORS OF WORKSTATIONS Kyung Dong Ryu, Doctor of Philosophy, 2001 Dissertation directed by: Associate Professor Jeffrey K. Hollingsworth Department of Computer Science Studies have shown that workstations are idle a significant fraction of the time. Traditional idle resource harvesting systems define a social contract that permits guest jobs to run only when a workstation is idle. To enforce this contract, guest jobs are stopped and migrated as soon as the owner resumes use of their machines. However, such systems waste many opportunities to exploit idle cycles because of overly conservative estimates of resource contention. In this thesis, we present a new policy, called Linger-Longer, that refines the social contract to permit fine-grain cycle stealing. Linger-Longer allows guest jobs to linger on a machine at low priority even when local tasks are active. Also, we developed a new adaptive job migration scheme based on runtime cost/benefit analysis. Our simulation study shows that the Linger-Longer policy can improve the throughput of guest jobs on a cluster by up to 60% with only a few percent slowdown of local jobs. The simulation also demonstrates that guest parallel jobs can perform better with our new approach than with the traditional run-time reconfiguration approach. To limit the impact of guest jobs' resource use, new local resource scheduling policies and mechanisms are required. We present a suite of mechanisms to support prioritized use of CPU, memory, I/O and network bandwidth. An overall prototype of the Linger-Longer system has been implemented in Linux. The prototype integrates the operating system extensions for resource throttling and a new adaptive migration policy module while leveraging general job scheduling and checkpointing mechanisms of an existing system. Using this prototype, we conduct a head-to-head performance comparison between our fine-grain cycle stealing policies and the traditional coarse-grain cycle stealing policies. The experiment on a Linux cluster with a set of benchmark applications show that, overall, Linger-Longer can improve the guest job throughput by 50% to 70%, with only a 3% host job slowdown. EXPLOITING IDLE CYCLES IN NETWORKS OF WORKSTATIONS
منابع مشابه
Assembly line balancing to minimize balancing loss and system loss
Assembly Line production is one of the widely used basic principles in production system. The problem of Assembly Line Balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. Research works reported in the literature mainly deals with minimization of idle time i.e...
متن کاملPredictive State Restoration in Desktop Workstation Clusters
Though existing systems for sharing distributed resources in clusters of workstations are generally e ective at recruiting idle resources, these systems often have a disruptive e ect on desktop workstation users. Even when recruiting computing cycles from strictly idle workstations, a by-product of running foreign jobs is that the virtual memory pages of the original user's idle processes are u...
متن کاملNon-Dedicated Distributed Environment: A Solution for Safe and Continuous Exploitation of Idle Cycles
The Non-Dedicated Distributed Environment (NDDE) aims to muster the idle processing power of interactive computers (workstations or PCs) into a virtual resource for parallel applications and grid computing. NDDE is novel in the sense that it allows for safe and continuous use of idle cycles. Differently from existing solutions, NDDE applications run inside a virtual machine rather than on the u...
متن کاملModels and Algorithms for Coscheduling Compute-Intensive Tasks on a Network of Workstations
The problem of using the idle cycles of a number of high performance workstations, interconnected by a high speed network, for solving computationally intensive tasks is discussed. The classes of distributed applications examined require Borne form of synchronization among the sub-tasks, hence the need for co-scheduling to guarantee that sub-tasks start at the same time and execute at the same ...
متن کاملExploiting Fine-Grained Idle Periods in Networks of Workstations
ÐStudies have shown that for a significant fraction of the time, workstations are idle. In this paper, we present a new scheduling policy called Linger-Longer that exploits the fine-grained availability of workstations to run sequential and parallel jobs. We present a two-level workload characterization study and use it to simulate a cluster of workstations running our new policy. We compare tw...
متن کامل